Automorphisms of Regular Wreath Product p-Groups

نویسنده

  • Jeffrey M. Riedl
چکیده

We present a useful new characterization of the automorphisms of the regular wreath product group P of a finite cyclic p-group by a finite cyclic p-group, for any prime p, and we discuss an application. We also present a short new proof, based on representation theory, for determining the order of the automorphism group Aut P , where P is the regular wreath product of a finite cyclic p-group by an arbitrary finite p-group.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph-wreath products and finiteness conditionsI

A notion of graph-wreath product of groups is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type Fn. Under various additional assumptions we show that these conditions are necessary. Our results generalize results of Bartholdi, Cornulier and Kochloukova about wreath products. Graphwreath products of groups include class...

متن کامل

Wreath Decompositions of Finite Permutation Groups

There is a familiar construction with two finite, transitive permutation groups as input and a finite, transitive permutation group, called their wreath product, as output. The corresponding 'imprimitive wreath decomposition concept is the first subject of this paper. A formal definition is adopted and an overview obtained for all such decompositions of any given finite, transitive group. The r...

متن کامل

Markov chains on orthogonal block structures

In this paper we define a particular Markov chain on some combinatorial structures called orthogonal block structures. These structures include, as a particular case, the poset block structures, which can be naturally regarded as the set on which the generalized wreath product of permutation groups acts as the group of automorphisms. In this case, we study the associated Gelfand pairs together ...

متن کامل

Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators

We associate a modal operator with each language belonging to a given class of regular languages and use the (reverse) wreath product of monoids with distinguished generators to characterize the expressive power of the resulting logic.

متن کامل

WREATH PRODUCTS AND REPRESENTATIONS OF p-LOCAL FINITE GROUPS

Given two finite p-local finite groups and a fusion preserving morphism between their Sylow subgroups, we study the question of extending it to a continuous map between the classifying spaces. The results depend on the construction of the wreath product of p-local finite groups which is also used to study p-local permutation representations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Math. Mathematical Sciences

دوره 2009  شماره 

صفحات  -

تاریخ انتشار 2009